1

Preface to Special Issue on Algorithms and Complexity

Year:
2019
Language:
english
File:
PDF, 136 KB
english, 2019
5

The probabilistic longest path problem

Year:
1999
Language:
english
File:
PDF, 141 KB
english, 1999
13

A survey of approximately optimal solutions to some covering and packing problems

Year:
1997
Language:
english
File:
PDF, 596 KB
english, 1997
14

Efficient algorithms for themax

Year:
2014
Language:
english
File:
PDF, 320 KB
english, 2014
23

When polynomial approximation meets exact computation

Year:
2018
Language:
english
File:
PDF, 558 KB
english, 2018
24

Probabilistic models for the Steiner Tree problem

Year:
2010
Language:
english
File:
PDF, 216 KB
english, 2010
25

Approximation results for the minimum graph coloring problem

Year:
1994
Language:
english
File:
PDF, 381 KB
english, 1994
28

Local approximations for maximum partial subgraph problem

Year:
2004
Language:
english
File:
PDF, 232 KB
english, 2004
30

The antennas preassignment problem

Year:
2004
Language:
english
File:
PDF, 304 KB
english, 2004
36

Fast reoptimization for the minimum spanning tree problem

Year:
2010
Language:
english
File:
PDF, 457 KB
english, 2010
37

On-line vertex-covering

Year:
2005
Language:
english
File:
PDF, 340 KB
english, 2005
40

Completeness in approximation classes beyond APX

Year:
2006
Language:
english
File:
PDF, 223 KB
english, 2006
48

A neural network for the minimum set covering problem

Year:
2000
Language:
english
File:
PDF, 142 KB
english, 2000
49

On-line independent set by coloring vertices

Year:
2001
Language:
english
File:
PDF, 551 KB
english, 2001
50

Improved Approximations for Weighted and Unweighted Graph Problems

Year:
2005
Language:
english
File:
PDF, 322 KB
english, 2005